Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KUNG HT")

Results 1 to 24 of 24

  • Page / 1
Export

Selection :

  • and

A BOUND ON THE MULTIPLICATION EFFICIENCY OF ITERATIONKUNG HT.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 102-107; BIBL. 4 REF.Conference Paper

THE STRUCTURE OF PARALLEL ALGORITHMSKUNG HT.1980; ADV. COMPUT.; ISSN 0065-2458; USA; DA. 1980; VOL. 19; PP. 65-112; BIBL. 5 P.Article

ON COMPUTING RECIPROCALS OF POWER SERIES.KUNG HT.1974; NUMER. MATH.; DTSCH.; DA. 1974; VOL. 22; NO 5; PP. 341-348; BIBL. 9 REF.Article

A REGULAR LAYOUT FOR PARALLEL ADDERSBRENT RP; KUNG HT.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 3; PP. 260-264; BIBL. 14 REF.Article

ON OPTIMISTIC METHODS FOR CONCURRENCY CONTROLKUNG HT; ROBINSON JT.1981; ACM TRANS. DATABASE SYST.; ISSN 0362-5915; USA; DA. 1981; VOL. 6; NO 2; PP. 213-226; BIBL. 15 REF.Article

CONCURRENT MANIPULATION OF BINARY SEARCH TREESKUNG HT; LEHMAN PL.1980; A.C.M. TRANS-DATABASE SYST.; USA; DA. 1980; VOL. 5; NO 3; PP. 354-382; BIBL. 24 REF.Article

FAST ALGORITHMS FOR PARTIAL FRACTION DECOMPOSITION.KUNG HT; TONG DM.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 582-593; BIBL. 1 P.Article

OPTIMAL ORDER OF ONE-POINT AND MULTIPLIANT ITERATION.KUNG HT; TRAUB JF.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 643-651; BIBL. 11 REF.Article

ON THE AREA OF BINARY TREE LAYOUTBRENT RP; KUNG HT.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 46-48; BIBL. 6 REF.Article

THE DESIGN OF SPECIAL-PURPOSE VLSI CHIPSFOSTER MJ; KUNG HT.1980; COMPUTER; USA; DA. 1980; VOL. 13; NO 1; PP. 26-40; (14 P.); BIBL. 14 REF.Article

NEW LOWER BOUNDS FOR REGULAR FINITE DIFFERENCE AND FINITE ELEMENT GRIDSBOJANCZYK A; KUNG HT.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 183-191; BIBL. 9 REF.Conference Paper

PARALLEL ALGORITHMS FOR SOLVING TRIANGULAR LINEAR SYSTEMS WITH SMALL PARALLELISM.HYAFIL L; KUNG HT.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 97; PP. 1-9; ABS. FR.; BIBL. 6 REF.Article

THE AREA-TIME COMPLEXITY OF BINARY MULTIPLICATIONBRENT RP; KUNG HT.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 3; PP. 521-534; BIBL. 28 REF.Article

AN OPTIMALITY THEORY OF CONCURRENCY CONTROL FOR DATABASESKUNG HT; PAPADIMITRIOU CH.1979; ACM-SIGMOD 1979. INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA/1979/BOSTON MA; USA; BOSTON: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1979; PP. 116-126; BIBL. 14 REF.Conference Paper

SORTING ON A MESH-CONNECTED PARALLEL COMPUTER.THOMPSON CD; KUNG HT.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 4; PP. 263-271; BIBL. 8 REF.Article

THE COMPLEXITY OF PARALLEL EVALUATION OF LINEAR RECURRENCES.HYAFIL L; KUNG HT.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 96; PP. 1-11; ABS. FR.; BIBL. 9 REF.Article

I/O COMPLEXITY: THE RED-BLUE PEBBLE GAMEHONG JW; KUNG HT.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 326-333; BIBL. 10 REF.Conference Paper

DESIGN OF SPECIAL-PURPOSE VLSI CHIPS: EXAMPLE AND OPINIONSFOSTER MJ; KUNG HT.1980; ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE. 7/1980/LA BAULE; USA; NEW YORK: IEEE; DA. 1980; PP. 300-307; BIBL. 11 REF.Conference Paper

FAST ALGORITHMS FOR MANIPULATING FORMAL POWER SERIESBRENT RP; KUNG HT.1978; J. ASS. COMPTG MACHIN.; USA; DA. 1978; VOL. 25; NO 4; PP. 581-595; BIBL. 38 REF.Article

THE COMPLEXITY OF PARALLEL EVALUATION OF LINEAR RECCURENCES.HYAFIL L; KUNG HT.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 513-521; BIBL. 10 REF.Article

ON FINDING THE MAXIMA OF A SET OF VECTORS.KUNG HT; LUCCIO F; PREPARATA FP et al.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 469-476; BIBL. 4 REF.Article

LOCKING POLICIES: SAFETY AND FREEDOM FROM DEADLOCKYANNAKAKIS M; PAPADIMITRIOU CH; KUNG HT et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 286-297; BIBL. 18 REF.Conference Paper

ON THE AVERAGE NUMBER OF MAXIMA IN A SET OF VECTORS AND APPLICATIONSBENTLEY JL; KUNG HT; SCHKOLNICK M et al.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 4; PP. 536-543; BIBL. 9 REF.Article

PAPERS: VLSI SYSTEMS AND COMPUTATIONS/CARNEGIE-MELLON UNIVERSITY CONFERENCE ON VLSI SYSTEMS AND COMPUTERS, PITTSBURGH PA, OCTOBER 19-21, 1981KUNG HT ED; SPROULL B ED; STEELE G ED et al.1981; VLSI SYSTEMS AND COMPUTERS. CONFERENCE ON VLSI SYSTEMS AND COMPUTERS/1981-10-19/PITTSBURGH PA; DEU/USA; BERLIN; NEW YORK: SPRINGER-VERLAG; DA. 1981; 426 P.; 25 CMConference Proceedings

  • Page / 1